Minimum Cost Spanning Tree MCST problem
نویسنده
چکیده
Originally studied for designing min cost connecting grid (in distribution, transportation, communication applications) to connect a set of cities. Under arc lengths > 0 min cost connecting network will bea spanning tree (ST). Earliest algo. (Boruvka's) dates back to 1926! Undirected, connected G = (N A c). To nd an uncon-strained MCST in G. c arbitrary. Constrained MCST problems (typical constraints involve degree constraints at nodes) are usually NP-hard.
منابع مشابه
An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem
Problem-specific encodings can improve the performance of metaheuristics, such as genetic algorithms or simulated annealing. This paper studies the link-biased (LB) encoding, which is a tree representation, and applies metaheuristics using this encoding to the minimum communication spanning tree (MCST) problem. Given the communication requirements of the nodes, the MCST problem seeks a communic...
متن کاملThe irreducible Core of a minimum cost spanning tree game
It is a known result that for a minimum cost spanning tree (mcst) game a Core allocation can be deduced directly from a mcst in the underlying network. To determine this Core allocation one only needs to determine a mcst in the network and it is not necessary to calculate the coalition values of the corresponding mcst game. In this paper we will deduce other Core allocations directly from the n...
متن کاملMinimum Cost Spanning Tree Problems with Restrictions on Coalitions
We focus on minimum cost spanning tree problems (mcstps) where agents need to be connected with a source directly or indirectly through other agents with the minimum cost. Mcstps have been studied as cooperative games, where all of agents cooperate to construct a minimum cost spanning tree (mcst), and share the cost of the mcst. There actually exist situations where some coalitions of agents ar...
متن کاملMulti-criteria minimum cost spanning tree games
The minimum cost spanning tree game (mcst-game) is a well-known model within operations research games that has been widely studied in the literature. In this paper we introduce the multi-criteria version of the mcst-game as a setvalued TU-game. We prove that the extension of Bird s cost allocation rule provides dominance core elements in this game. We also give a family of core solutions that ...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کامل